Regular Expressions for Muller Context-Free Languages
نویسندگان
چکیده
Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the known results regarding MCFLs, and show that a language is an MCFL if and only if it can be generated by a so-called μη-regular expression.
منابع مشابه
T F L T C E F L
We survey recent results on the enumeration of formal languages. In particular, we consider enumeration of regular languages accepted by deterministic and nondeterministic finite automata with n states, regular languages generated by regular expressions of a fixed length, and ω-regular languages accepted by Müller automata. We also survey the uncomputability of enumeration of context-free langu...
متن کاملRegular Expressions and Context-Free Grammars for Picture Languages
We introduce a new concept of regular expression and context-free grammar for picture languages (sets of matrices over a nite alphabet) and compare and connect these two formalisms.
متن کاملEnumerating Regular Expressions and Their Languages
In this chapter we discuss the problem of enumerating distinct regular expressions bysize and the regular languages they represent. We discuss various notions of the size of a regularexpression that appear in the literature and their advantages and disadvantages. We consider aformal definition of regular expressions using a context-free grammar.We then show how to enumerate stri...
متن کاملConjunctive Context-Free Path Queries
In graph query languages, regular expressions are commonly used to specify the labeling of paths. A natural step in increasing the expressive power of these query languages is replacing regular expressions by context-free grammars. With the Conjunctive Context-Free Path Queries (CCFPQ) we introduce such a language based on the well-known Conjunctive Regular Path Queries (CRPQ). First, we show t...
متن کاملA Typed, Algebraic Approach to Parsing
In this paper, we recall the de nition of the context-free expressions (or μ-regular expressions), an algebraic presentation of the context-free languages. Then, we de ne a core type system for the context-free expressions to pick out those expressions which can be parsed unambiguously by predictive algorithms such as recursive descent or LL(k) style tabular parsing. Next, we extend the notion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 23 شماره
صفحات -
تاریخ انتشار 2017